Less is More: Data-Efficient Complex Question Answering Over Knowledge Bases

نویسندگان

چکیده

Question answering is an effective method for obtaining information from knowledge bases (KB). In this paper, we propose NS-CQA, a data-efficient reinforcement learning framework complex question by using only modest number of training samples. Our consists neural generator and symbolic executor that, respectively, transforms natural-language into sequence primitive actions, executes them over the base to compute answer. We carefully formulate set actions that allows us not simplify our network design but also accelerate model convergence. To reduce search space, employ copy masking mechanisms in encoder-decoder architecture drastically decoder output vocabulary improve generalizability. equip with memory buffer stores high-reward promising programs. Besides, adaptive reward function. By comparing generated trial trials stored buffer, derive curriculum-guided bonus, i.e., proximity novelty. mitigate sparse problem, combine reshaping dense feedback. Also, encourage generate new avoid imitating spurious while making remember past data efficiency. NS-CQA evaluated on two datasets: CQA, recent large-scale dataset, WebQuestionsSP, multi-hop dataset. On both datasets, outperforms state-of-the-art models. Notably, performs well questions higher complexity, approximately 1% total

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QUINT: Interpretable Question Answering over Knowledge Bases

We present QUINT, a live system for question answering over knowledge bases. QUINT automatically learns role-aligned utterance-query templates from user questions paired with their answers. When QUINT answers a question, it visualizes the complete derivation sequence from the natural language utterance to the final answer. The derivation provides an explanation of how the syntactic structure of...

متن کامل

KBQA: Learning Question Answering over QA Corpora and Knowledge Bases

Question answering (QA) has become a popular way for humans to access billion-scale knowledge bases. Unlike web search, QA over a knowledge base gives out accurate and concise results, provided that natural language questions can be understood and mapped precisely to structured queries over the knowledge base. The challenge, however, is that a human can ask one question in many different ways. ...

متن کامل

A Joint Model for Question Answering over Multiple Knowledge Bases

As the amount of knowledge bases (KBs) grows rapidly, the problem of question answering (QA) over multiple KBs has drawn more attention. The most significant distinction between multiple KB-QA and single KB-QA is that the former must consider the alignments between KBs. The pipeline strategy first constructs the alignments independently, and then uses the obtained alignments to construct querie...

متن کامل

Data complexity of answering conjunctive queries over SHIQ knowledge bases

In [6] the authors give an algorithm for answering conjunctive queries over ALCN R knowledge bases which is coNP in data complexity. Their technique is based on the tableau technique for checking sat-isfiability in ALCN R presented in [2]. In their algorithm, the blocking conditions of [2] are weakened in such a way that the set of models their algorithm yields suffices to check query entailmen...

متن کامل

Query Answering over CFDnc Knowledge Bases

We consider the problem of answering conjunctive queries in the description logic CFDnc, a generalization of the logic CFDnc in which universal restrictions are now permitted on left-hand-sides of inclusion dependencies. We show this problem retains PTIME data complexity and exhibit a procedure in the spirit of OBDA in which a relational engine can be usefully employed to address scalability is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Science Research Network

سال: 2021

ISSN: ['1556-5068']

DOI: https://doi.org/10.2139/ssrn.3769518